Monotone one-port circuits
نویسندگان
چکیده
Maximal monotonicity is explored as a generalization of the linear theory passivity, aiming at an algorithmic input/output analysis physical models. The developed for maximal monotone one-port circuits, formed by series and parallel interconnection basic elements. These circuits generalize passive LTI transfer functions. Periodic input signals are shown to be mapped periodic output signals, these input-output behaviors can efficiently computed using splitting algorithm, which decomposes computation according circuit topology. A new algorithm presented, applies any defined port
منابع مشابه
Monotone Circuits: One-Way Functions versus Pseudorandom Generators
We study the computability of one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two: On one hand, there exist one-way functions that are computable by (uniform) polynomial-size monotone functions, provided (of course) that one-way functions exist at all. On the other hand, no monotone function can be a pseudorandom generator.
متن کاملOn Monotone Planar Circuits
In this paper we show several results about monotone planar circuits. We show that monotone planar circuits of bounded width, with access to negated input variables, compute exactly the functions in non-uniform AC0. This provides a striking contrast to the non-planar case, where exactly NC1 is computed. We show that the circuit value problem for monotone planar circuits, with inputs on the oute...
متن کامل2 Monotone Functions and Monotone Circuits
In the last lecture we looked at lower bounds for constant-depth circuits, proving that PARITY cannot be computed by constant-depth circuits, i.e. PARITY / ∈ AC0. General circuit lower bounds for explicit functions are quite weak: the best we can prove after years of effort is that there is a function, which requires circuits of size 5n − o(n). In this lecture we will examine what happens if we...
متن کاملMonotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of computing them is adding the weights of the satisfied variables and checking if the sum is greater than the threshold; this algorithm is inherently non-monotone since addition is a non-monotone function. In this work w...
متن کاملNon-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits
Cancellations are known to be helpful in e cient algebraic computation of polynomials over elds. We de ne a notion of cancellation in Boolean circuits and de ne Boolean circuits that do not use cancellation to be non-cancellative. Non-cancellative Boolean circuits are a natural generalization of monotone Boolean circuits. We show that in the absence of cancellation, Boolean circuits require sup...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2023
ISSN: ['0018-9286', '1558-2523', '2334-3303']
DOI: https://doi.org/10.1109/tac.2023.3274690